System and method for identifying transient friends

ABSTRACT

A system and method for identifying transient friends for a social network of a user are provided. A transient friend processing function obtains locations of a number of users or locations otherwise associated with the number of users. In order to identify transient friends for a first user, the transient friend processing function identifies other users associated with locations within a proximate area of the first user. For each of the identified users, the transient friend processing function compares a user profile of the first user to a user profile of the identified user to determine whether to add the identified user as a transient friend of the first user. If the transient friend processing function determines that the identified friend is to be added as a transient friend of the first user, the identified friend is then added as a transient friend of the first user.

RELATED APPLICATIONS

This patent application is a continuation of U.S. patent applicationSer. No. 13/036,370 filed Feb. 28, 2011, entitled “SYSTEM AND METHOD FORIDENTIFYING TRANSIENT FRIENDS,” now U.S. Pat. No. 8,209,416, which is acontinuation of U.S. patent application Ser. No. 12/013,147, filed Jan.11, 2008, entitled “SYSTEM AND METHOD FOR IDENTIFYING TRANSIENTFRIENDS,” now U.S. Pat. No. 8,024,431, which claims the benefit ofprovisional patent application Ser. No. 61/016,074, filed Dec. 21, 2007,the disclosures of which are hereby incorporated herein by reference intheir entireties.

FIELD OF THE INVENTION

The present invention relates to social networking and more specificallyrelates to identifying transient friends for a social network.

BACKGROUND OF THE INVENTION

Today's digital world includes numerous examples of social networks. Forexample, chat applications, instant messaging applications, socialnetworking websites, and the like enable a user to create a socialnetwork of friends with which the user interacts. With the proliferationof mobile devices such as mobile smart phones, an opportunity exists toextend traditional concepts of social networking among users ofstationary devices to social networking among users of mobile devices.However, whether implemented among users of stationary devices or usersof mobile devices, one issue with traditional social networks is thediscovery of new friends. A user must typically have prior knowledge ofusers that he or she wishes to add as friends or manually select usersto add as friends from a global list of users. Thus, there is a need fora system and method of identifying friends for social networks in amobile environment.

SUMMARY OF THE INVENTION

The present invention relates to identifying transient friends for asocial network. In general, a transient friend processing functionobtains locations of a number of users or locations otherwise associatedwith the number of users. In order to identify transient friends for afirst user, the transient friend processing function identifies otherusers associated with locations within a proximate area of the firstuser. For each of the identified users, the transient friend processingfunction compares a user profile of the first user to a user profile ofthe identified user to determine whether to add the identified user as atransient friend of the first user. If the transient friend processingfunction determines that the identified friend is to be added as atransient friend of the first user, the identified friend is then addedas a transient friend of the first user.

More specifically, in one embodiment, in order to determine whether toadd an identified user associated with a location within the proximatearea of the first user as a transient friend of the first user, thetransient friend processing function compares a user profile of thefirst user to a user profile of the identified user to provide acorrelation score. If the correlation score is greater than an auto-addthreshold, the identified user is added as a transient friend of thefirst user. If the correlation score is less than the auto-add thresholdbut greater than a manual-add threshold, the first user is notified ofthe identified user and enabled to choose whether to accept theidentified user as a transient friend. If the first user accepts theidentified user as a transient friend, the identified user is added as atransient friend of the first user.

The transient friend processing function also operates to monitor thetransient friends of the first user. If a transient friend is no longerwithin the proximate area of the first user, the transient friend isremoved as a transient friend of the first user. In one embodiment, aproximity exit delay is used such that the transient friend must remainoutside of the proximate area of the first user for an amount of timedefined by the proximity exit delay before being removed as a transientfriend of the first user. Before removing the transient friend, thetransient friend processing function may notify the first user andenable the first user to choose whether to promote the transient friendto a persistent friend or to allow the transient friend to be removed.

In one embodiment, a user recently removed as a transient friend of thefirst user is prevented from being added as a transient friend of thefirst user. More specifically, once a user is removed as a transientfriend, a re-establish wait period is established such that the usercannot be added as a transient friend of the first user until there-establish wait period has expired. This may be desirable to ensurethat users near a boundary of the proximate area of the first user arenot repeatedly added and removed as transient friends of the first user.

The first user may also choose to block a user from being added as atransient friend. More specifically, in one embodiment, the first usermay select a user such as a user listed as a transient friend of thefirst user and choose to block that user. As a result, if the blockeduser is a transient friend, the blocked user is removed as a transientfriend. In addition, the blocked user is prevented from being added as atransient friend of the first user in the future. The first user maythereafter unblock the blocked user if desired.

Those skilled in the art will appreciate the scope of the presentinvention and realize additional aspects thereof after reading thefollowing detailed description of the preferred embodiments inassociation with the accompanying drawing figures.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

The accompanying drawing figures incorporated in and forming a part ofthis specification illustrate several aspects of the invention, andtogether with the description serve to explain the principles of theinvention.

FIG. 1 illustrates a system incorporating a transient friend processingfunction according to one embodiment of the present invention;

FIGS. 2A through 2C graphically illustrate the operation of thetransient friend processing function of FIG. 1 according to oneembodiment of the present invention;

FIGS. 3A and 3B are flow charts illustrating the operation of thetransient friend processing function to identify transient friendsaccording to one embodiment of the present invention;

FIG. 4 is a flow chart illustrating the operation of the transientfriend processing function to monitor transient friends according to oneembodiment of the present invention;

FIG. 5 graphically illustrates the concept of a proximity exit delay anda re-establish wait period according to one embodiment of the presentinvention;

FIG. 6 is a block diagram of the central server of FIG. 1 according toone embodiment of the present invention; and

FIG. 7 is a block diagram of one of the user devices of FIG. 1 accordingto one embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The embodiments set forth below represent the necessary information toenable those skilled in the art to practice the invention and illustratethe best mode of practicing the invention. Upon reading the followingdescription in light of the accompanying drawing figures, those skilledin the art will understand the concepts of the invention and willrecognize applications of these concepts not particularly addressedherein. It should be understood that these concepts and applicationsfall within the scope of the disclosure and the accompanying claims.

FIG. 1 illustrates a system 10 for identifying and monitoring transientfriends according to one embodiment of the present invention. Ingeneral, the system 10 includes a central server 12, a number of mobileuser devices 14-1 through 14-N, and optionally one or more stationaryuser device 16 connected via a network 18. The network 18 is alsoreferred to herein as a communication network. The network 18 may be anytype Wide Area Network (WAN) or Local Area Network (LAN), or anycombination thereof. In addition, the network 18 may include wiredcomponents, wireless components, or both wired and wireless components.Users 20-1 through 20-N are associated with the mobile user devices 14-1through 14-N. A user 22 is associated with the stationary user device16. Note that while a single central server 12 is illustrated in FIG. 1,the present invention is not limited thereto. The functionality of thecentral server 12 may alternatively be distributed among multipleservers.

The central server 12 includes a transient friend processing function 24and user records 26. The transient friend processing function 24 ispreferably implemented in software. However, the present invention isnot limited thereto. The transient friend processing function 24 may beimplemented in software, hardware, or a combination thereof. Thetransient friend processing function 24 includes a transient friendidentification function 28 and a transient friend monitoring function30. The transient friend identification function 28 generally operatesto identify transient friends for each of the users 20-1 through 20-Nand 22. As used herein, for a first user, a transient friend of thefirst user is a second user located within a proximate area of the firstuser, or otherwise associated with a location within the proximate areaof the first user, and, optionally, having one or more attributes thatare substantially similar to one or more attributes of the first user.Once identified as a transient friend, the second user's continuedstatus as a transient friend of the first user is dependant upon thelocation of, or location associated with, the second user being withinthe proximate area of the first user and, optionally, substantialsimilarity between the one or more attributes of the second user and theone or more attributes of the first user.

The transient friend monitoring function 30 operates to monitor thetransient friends of the users 20-1 through 20-N and 22. Morespecifically, using the user 20-1 as an example, the transient friendmonitoring function 30 generally operates to monitor the transientfriends of the user 20-1 such that other users from the users 20-2through 20-N and 22 that are identified as the transient friends of theuser 20-1 are removed as transient friends when they are no longerwithin the proximate area of the user 20-1. In one embodiment, aproximity exit delay is implemented such that a user is not removed as atransient friend until the user is outside of the proximate area of theuser 20-1 for an amount of time defined by the proximity exit delay.This may be beneficial where a user is near a boundary of the proximatearea of the user 20-1 and, as such, may enter and leave the proximatearea of the user 20-1 frequently. The proximity exit delay, as well as are-establish wait period discussed below, provides stability in such ascenario.

The user records 26 include a user record for each of the users 20-1through 20-N and 22. Again using the user 20-1 as an example, the userrecord for the user 20-1 includes information identifying the user 20-1such as, for example, a user identifier (ID), a user profile of the user20-1 which includes a number of attributes of the user 20-1, one or morelocations associated with the user 20-1 which are also referred toherein as physical locations, a list of persisted or permanent friendsof the user 20-1, a list of transient friends of the user 20-1, a listof recently removed friends of the user 20-1, and a list of blockedusers that are to be prevented from being added as transient friends ofthe user 20-1. The user profile of the user 20-1 includes one or moreattributes of the user 20-1 such as, for example, biographicalinformation; demographic information; music preferences such as one ormore favorite music genres, one or more favorite music artists, one ormore favorite songs, or one or more favorite time periods; videopreferences such as one or more favorite movie genres, one or morefavorite television show genres, one or more favorite actors oractresses, one or more favorite time periods; hobbies; or the like. Theattributes of the user 20-1 may also include one or more criteriadefined by the user 20-1 for identifying transient friends such as, forexample, biographical information describing a desired transient friend,demographic information describing a desired transient friend, musicpreferences of a desired transient friend, video preferences of adesired transient friend, one or more hobbies of a desired transientfriend, or the like. As discussed below, in one embodiment, the list ofrecently removed friends also includes a time of removal for each of therecently removed friends. The time of removal is a time at which thecorresponding recently removed friend was removed as a transient friendof the user 20-1.

The one or more locations associated with the user 20-1 may include acurrent location of the user 20-1 and, optionally, one or more previouslocations of the user 20-1. In addition or alternatively, the locationsassociated with the user 20-1 may include, for example, a home addressof the user 20-1, a work address of the user 20-1, or the like. Notethat while the discussion below focuses on identifying transient friendsfor the user 20-1 based on a single location associated with the user20-1 for ease of discussion, transient friends may be identified for theuser 20-1 using each of any number of locations associated with the user20-1. Alternatively, the current location of the user 20-1 may be usedto identify other users within the proximate area of the user 20-1,whereas any additional locations of the user 20-1 may be consideredattributes and used to identify transient friends in a manner similar tothe attributes in the user profile of the user 20-1.

The user record of the user 20-1 may also include information definingor otherwise identifying a proximate area of the user 20-1. In general,the proximate area of the user 20-1 is a geographic area surrounding theuser 20-1. In one embodiment, the proximate area of the user 20-1 is acircular area where the information defining the proximate area of theuser 20-1 is a maximum distance or radius from the user 20-1. However,the present invention is not limited thereto. The proximate area of theuser 20-1 may be defined by the user 20-1 or may be system-defined. Inan alternative embodiment, rather than storing information defining theproximate area of the user 20-1 in the user profile of the user 20-1,the proximate area of the user 20-1 as well as all of the other users20-2 through 20-N and 22 may be hard-coded into the transient friendprocessing function 24.

The mobile user devices 14-1 through 14-N are mobile devices. Forexample, each of the mobile user devices 14-1 through 14-N may be amobile phone such as or similar to an Apple iPhone, a portable mediaplayer such as or similar to an Apple iPod® or Microsoft Zune® mediaplayer having network capabilities, a notebook computer, or the like.The mobile user devices 14-1 through 14-N generally include socialnetworking applications 32-1 through 32-N and location determinationfunctions 34-1 through 34-N, respectively. Using the mobile user device14-1 as an example, the social networking application 32-1 may beimplemented in software, hardware, or a combination of software andhardware. The social networking application 32-1 is generally any typeof application that utilizes a social network. For example, the socialnetworking application 32-1 may be a text-based or voice-based chat orinstant messaging application, a media recommendation application, orthe like. In one embodiment, the social networking application 32-1 is asocial network based media recommendation application such as or similarto the one described in commonly owned and assigned U.S. patentapplication Ser. No. 11/484,130, entitled P2P NETWORK FOR PROVIDING REALTIME MEDIA RECOMMENDATIONS, which was filed on Jul. 11, 2006 and ishereby incorporated herein by reference in its entirety.

The location determination function 34-1 may be implemented in software,hardware, or a combination thereof. In general, the locationdetermination function 34-1 determines or otherwise obtains a locationof the mobile user device 14-1 and provides the location to the centralserver 12 automatically or upon request. For example, the locationdetermination function 34-1 may be a Global Positioning System (GPS)receiver or the like. As another example, the location determinationfunction 34-1 may obtain the location of the mobile user device 14-1from an external source. More specifically, if the mobile user device14-1 has access to a wireless telecommunications network, the locationof the mobile user device 14-1 may be determined by a server or someother component of the wireless telecommunications network using atechnique such as, but not limited to, triangulation. If the mobile userdevice 14-1 has a local wireless interface such as a Bluetooth interfaceor one of the suite of IEEE 802.11 wireless interfaces, the mobile userdevice 14-1 may obtain its location from a source within its localwireless communication area. As another example, the locationdetermination function 34-1 may obtain the location of the mobile userdevice 14-1 from the user 20-1. More specifically, the locationdetermination function 34-1 may query the user 20-1 for the location ofthe mobile user device 14-1 or otherwise enable the user 20-1 enter thelocation of the mobile user device 14-1. The user 20-1 may provide thelocation of the mobile user device 14-1 in the form of a physicaladdress or the like.

In an alternative embodiment, the mobile user device 14-1 does notinclude the location determination function 34-1, and the location ofthe mobile user device 14-1 is otherwise provided to or obtained by thecentral server 12. For example, as discussed above, the mobile userdevice 14-1 may be associated with a wireless telecommunications networkin one embodiment. As such, a server or other component of the wirelesstelecommunications network may obtain the location of the mobile userdevice 14-1 using a technique such as, but not limited to,triangulation. The location of the mobile user device 14-1 may then beprovided to the central server 12 automatically or upon request. Asanother alternative, the central server 12 may be a component of thewireless telecommunications network and be responsible for determiningthe location of the mobile user device 14-1 using a technique such as,but not limited to, triangulation.

In another alternative embodiment, the mobile user device 14-1 maytransiently connect to the network 18 via a local wireless interfacesuch as a Bluetooth wireless interface or one of the suite of IEEE802.11 wireless interfaces. In this case, the mobile user device 14-1may use the local wireless interface to connect to the central server 12through distributed access points. The central server 12 may thendetermine the location of the mobile user device 14-1 using an InternetProtocol (IP) address of the mobile user device 14-1 or the like. Notethat techniques for determining location based on an IP address areknown in the art.

The stationary user device 16 may be, for example, a desktop computer orsimilar consumer device having network capabilities. Like the mobileuser devices 14-1 through 14-N, the stationary user device 16 includes asocial networking application 36, which may be implemented in software,hardware, or a combination thereof. The stationary user device 16 mayinclude a location determination function 38. Alternatively, thelocation of the stationary user device 16 may be provided by the user22, determined by the central server 12 based on an IP address of thestationary user device 16, or the like.

Note that in another embodiment, the stationary user device 16 may be adevice such as a server, personal computer, or the like associated witha business or other public facility, and the user 22 may be an automateduser and therefore referred to as automated user 22. As such, when thebusiness or other public facility is within the proximate area of, forexample, the user 20-1, the automated user 22 may be identified as atransient friend of the user 20-1. As a result, the automated user 22may, for example, send information regarding the business or otherpublic facility to the user 20-1. For example, the automated user 22 maysend advertisements, media recommendations, or the like to the user20-1.

FIGS. 2A through 2C illustrate the general operation of the transientfriend processing function 24 of FIG. 1 according to one embodiment ofthe present invention. FIG. 2A illustrates a proximate area 40 of userA. In this example, the proximate area 40 is a circular area defined bya radial distance R. However, the present invention is not limitedthereto. FIG. 2B illustrates a scenario where user B has entered theproximate area 40 of user A. As discussed below, the transient friendidentification function 28 first detects that user B is within theproximate area 40 of user A and then compares a user profile of user Ato a user profile of user B to determine a correlation score. If thecorrelation score is greater than an auto-add threshold, user B isautomatically added as a transient friend of user A. If the correlationscore is less than the auto-add threshold but greater than a manual-addthreshold, user A is notified of user B and enabled to choose whether toadd user B as a transient friend. In this example, assume that user Bhas been added as a transient friend of user A.

FIG. 2C illustrates a scenario where user B, after being added as atransient friend of user A, is no longer within the proximate area 40 ofuser A. As discussed below, the transient friend monitoring function 30first detects that user B is outside the proximate area 40 of user A andthen determines whether to remove user B as a transient friend of userA. In one embodiment, after user B has been outside the proximate area40 for an amount of time equal to or greater than a proximity exitdelay, the transient friend monitoring function 30 notifies user A andenables user A to choose whether to promote user B from a transientfriend to a persisted friend or to remove user B as a transient friend.Alternatively, the transient friend monitoring function 30 mayautomatically remove user B as a transient friend of user A.

FIGS. 3A and 3B are flow charts illustrating the operation of thetransient friend identification function 28 according to one embodimentof the present invention. Note that although the following process isdiscussed as being performed to identify transient friends of the user20-1, the process is also performed to identify transient friends ofeach of the other users 20-2 through 20-N and 22. First, the transientfriend identification function 28 identifies one or more users from theother users 20-2 through 20-N and 22 within the proximate area of theuser 20-1 to create a list of proximate users (step 100). A firstproximate user from the list of proximate users is identified (step102). The transient friend identification function 28 then determineswhether the proximate user is a persisted friend (step 104). Morespecifically, in order to determine whether the proximate user is apersisted friend of the user 20-1, the transient friend identificationfunction 28 may compare a user ID of the proximate user to the list ofpersisted friends for the user 20-1. If the proximate user is in thelist of persisted friends for the user 20-1, then the proximate user isalready a persisted friend of the user 20-1. If the proximate user is apersisted friend of the user 20-1, the process proceeds to step 128(FIG. 3B).

If the proximate user is not a persisted friend of the user 20-1, thetransient friend identification function 28 then determines whether theproximate user is a user blocked by the user 20-1 (step 106). Morespecifically, in order to determine whether the proximate user is a userblocked by the user 20-1, the transient friend identification function28 may compare a user ID of the proximate user to the list of blockedusers for the user 20-1. If the proximate user is in the list of blockedusers for the user 20-1, then the proximate user is a user blocked bythe user 20-1. If the proximate user is a blocked user, the processproceeds to step 128 (FIG. 3B).

If the proximate user is not a blocked user, the transient friendidentification function 28 then determines whether the proximate user isa user recently removed as a transient friend of the user 20-1 (step108). More specifically, in order to determine whether the proximateuser is a user recently removed as a transient friend of the user 20-1,the transient friend identification function 28 may compare a user ID ofthe proximate user to a list of recently removed users for the user20-1. If the proximate user is in the list of recently removed users forthe user 20-1, then the proximate user is a user recently removed by theuser 20-1. If the proximate user is not a recently removed user, theprocess proceeds to step 114.

In this embodiment, if the proximate user is a recently removed user,the transient friend identification function 28 then determines whethera re-establish wait period for the proximate user has expired (step110). The re-establish wait period is a user-defined or system-definedamount of time that must expire before a user removed as a transientfriend can be re-established as a transient friend. In order todetermine whether the re-establish wait period has expired, thetransient friend identification function 28 may first determine anexpiration time corresponding to a removal time identifying a time atwhich the proximate user was removed as a transient friend of the user20-1 plus the amount of time defined by the re-establish wait period. Ifthe current time is after the expiration time, then the re-establishwait period has expired. Otherwise, the re-establish wait period has notexpired. If the re-establish wait period has not expired, the processproceeds to step 128 (FIG. 3B). If the re-establish wait period hasexpired, the transient friend identification function 28 removes theproximate user from the recently removed friends list for the user 20-1(step 112).

At this point, the transient friend identification function 28 comparesthe user profile of the proximate user to the user profile of the user20-1 to provide a correlation score (step 114). The correlation scoremay be provided using any desired comparison technique. For example, thecorrelation score may be a number of attributes from the user profile ofthe proximate user that match or are within some defined range ofcorresponding attributes from the user profile of the user 20-1, or viceversa. As another example, the correlation score may be provided as apercentage of attributes in the user profile of the proximate user thatmatch or are within a defined range of corresponding attributes in theuser profile of the user 20-1, or vice versa. Note that weights may beassigned to user attributes such that some user attributes affect thecorrelation score more than others.

Note that comparing the user profile of the proximate user to the userprofile of the user 20-1 to provide a correlation score is optional.Alternatively, all other users within the proximate area of the user20-1 may be added as transient friends of the user 20-1. In anotheralternative embodiment, up to some defined maximum number of the otherusers within the proximate area of the user 20-1 may be added astransient friends of the user 20-1. As another alternative embodiment,up to a defined maximum number of other users that are closest to thelocation of the user 20-1 may be added as transient friends of the user20-1. Note that these alternative embodiments are exemplary. Other typesof criteria may be used in order to select transient friends from otherusers within the proximate area of the user 20-1.

Once the correlation score is determined, the transient friendidentification function 28 determines whether the correlation score isgreater than an auto-add threshold (step 116). The auto-add thresholdmay be a user-defined threshold or a system-defined threshold. Further,the auto-add threshold may be static or dynamic. For example, the user20-1 may adjust the auto-add threshold when desired. As another example,the transient friend identification function 28 may dynamically changethe auto-add threshold as a function of factors such as, for example, anumber of transient friends in the transient friends list of the user20-1, a number of transient friends in the transient friends list of theuser 20-1 as compared to a desired number of transient friends, a totalnumber of persisted friends and transient friends of the user 20-1, atotal number of persisted friends and transient friends of the user 20-1as compared to a desired number of persisted and transient friends, orthe like.

If the correlation score is greater than the auto-add threshold, thetransient friend identification function 28 adds the proximate user tothe list of transient friends for the user 20-1 (step 118). The processthen proceeds to step 128. If the correlation score is less than theauto-add threshold, the transient friend identification function 28determines whether the correlation score is greater than a manual-addthreshold (step 120). The manual-add threshold may be a user-definedthreshold defined by the user 20-1 or a system-defined threshold.Further, the manual-add threshold may be static or dynamic. For example,the user 20-1 may adjust the manual-add threshold when desired. Asanother example, the transient friend identification function 28 maydynamically change the manual-add threshold as a function of factorssuch as, for example, a number of transient friends in the transientfriends list of the user 20-1, a number of transient friends in thetransient friends list of the user 20-1 as compared to a desired numberof transient friends, a total number of persisted friends and transientfriends of the user 20-1, a total number of persisted friends andtransient friends of the user 20-1 as compared to a desired number ofpersisted and transient friends, or the like. Note that the manual-addthreshold may be any desired value less than or equal to the auto-addthreshold. Further, if desired, the manual-add threshold may be zerosuch that the user 20-1 is given the option to choose whether to addproximate users as transient friends for all proximate users havingcorrelation scores less than the auto-add threshold. In contrast, themanual-add score may be set equal to the auto-add threshold such thatall proximate users having correlation scores less than the auto-addthreshold are not added as transient friends of the user 20-1.

If the correlation score is not greater than the manual-add threshold,the process proceeds to step 128. If the correlation score is greaterthan the manual-add threshold, the transient friend identificationfunction 28 notifies the user 20-1 and enables the user 20-1 to choosewhether to add the proximate user as a transient friend (step 122). Thenotification may include information identifying the proximate user, thecorrelation score, one or more of the attributes of the proximate userfrom the user profile of the proximate user, or the like.

Based on a response from the user 20-1, the transient friendidentification function 28 determines whether to add the proximate useras a transient friend for the user 20-1 (step 124). If the user 20-1 haschosen not to add the proximate user as a transient friend, the processproceeds to step 128. Otherwise, the transient friend identificationfunction 28 adds the proximate user to the list of transient friends forthe user 20-1 (step 126).

At this point, the transient friend identification function 28determines whether the proximate user is the last proximate user in thelist of proximate users provided in step 102 (step 128). If not, a nextproximate user in the list of proximate users is identified (step 130),and then the process returns to step 104 (FIG. 3A). Once the lastproximate user in the list of proximate users is processed, the processends. Note that transient friend identification function 28 may thenperform the process of FIGS. 3A and 3B for each of the other users 20-2through 20-N and 22. Alternatively, the transient friend identificationfunction 28 may include a separate thread or process for each of theusers 20-1 through 20-N and 22.

Note that, in the embodiment described above, the correlation score isimplemented such that the proximate user is automatically added as atransient friend if the correlation score is greater than the auto-addthreshold. If not, the proximate user may be manually added as atransient friend if the correlation score is greater than the manual-addthreshold. However, the correlation score may alternatively beimplemented such that the proximate user is automatically added as atransient friend if the correlation score is less than an auto-addthreshold and may be manually added as a transient friend if thecorrelation score is greater than the auto-add threshold but less than amanual-add threshold.

FIG. 4 is a flow chart illustrating the operation of the transientfriend monitoring function 30 of FIG. 1 according to one embodiment ofthe present invention. Note that while the following process isdiscussed as being performed to monitor the transient friends of theuser 20-1, the process is also performed to monitor the transientfriends of each of the other users 20-2 through 20-N and 22. First, thetransient friend monitoring function 30 identifies a first transientfriend in the list of transient friends of the user 20-1 (step 200).Next, the transient friend monitoring function 30 determines whether theuser 20-1 has issued a block request for the transient friend (step202). More specifically, in one embodiment, the user 20-1 may select oneor more users identified as transient friends and choose to block theselected users from being transient friends. If the user 20-1 has issueda block request for the transient friend, the transient friendmonitoring function 30 adds the corresponding user to the list ofblocked users for the user 20-1, removes the corresponding user as atransient friend of the user 20-1, and proceeds to step 220 (step 204).

If the user 20-1 has not issued a block request for the transientfriend, the transient friend monitoring function 30 determines whetherthe transient friend is still in the proximate area of the user 20-1(step 206). If so, the process proceeds to step 220. In an alternativeembodiment, before proceeding to step 220, the transient friendmonitoring function 30 may determine whether the user profile of thetransient friend or the user profile of the user 20-1 has changed. Ifso, the correlation score is updated. If the updated correlation scoreis below an auto-removal threshold, the transient friend may beautomatically removed. If the updated correlation score is greater thanthe auto-removal threshold but less than a manual-remove threshold, theuser 20-1 may be notified and enabled to choose whether to remove thetransient friend.

Returning to step 206, if the transient friend is not in the proximatearea of the user 20-1, the transient friend monitoring function 30determines whether a proximity exit delay for the transient friend hasexpired (step 208). More specifically, in one embodiment, a time isrecorded upon first detecting that the transient friend is no longerwithin the proximate area of the user 20-1. The proximity exit delaydefines an amount of time that the transient friend must remain outsideof the proximate area of the user 20-1 before being removed as atransient friend of the user 20-1. Thus, in order for the proximity exitdelay to expire, more than one iteration of the process of FIG. 4 may berequired between the time at which the transient friend is firstdetected as being outside the proximate area of the user 20-1 and thetime at which the proximity exit delay has expired. If the proximityexit delay has not expired, the process proceeds to step 220.

In this embodiment, if the proximity exit delay has expired, thetransient friend monitoring function 30 notifies the user 20-1 andenables the user 20-1 to choose whether to add the transient friend as apersisted friend or to allow the transient friend to be removed (step210). Alternatively, the transient friend may automatically be removed.Based on a response from the user 20-1, the transient friend monitoringfunction 30 determines whether to remove the transient friend (step212). If the transient friend is not to be removed, the transient friendmonitoring function 30 promotes the transient friend to a persistedfriend (step 214). More specifically, the corresponding user is removedfrom the transient friends list of the user 20-1 and added to thepersisted friends list of the user 20-1.

If the user 20-1 chooses to remove the transient friend, the transientfriend monitoring function 30 removes the corresponding user from thetransient friends list of the user 20-1 (step 216). The transient friendmonitoring function 30 also adds the corresponding user as a recentlyremoved friend (step 218). More specifically, the corresponding user isadded to the list of recently removed friends for the user 20-1. Inaddition, if the use of a re-establish wait period is desired, thecurrent time is recorded as a time of removal for the correspondinguser.

At this point, the transient friend monitoring function 30 determineswhether there are more transient friends in the transient friends listof the user 20-1 (step 220). If so, a next transient friend isidentified (step 222), and the process returns to step 202 and isrepeated. Once the last transient friend is processed, the process ends.Note that transient friend monitoring function 30 may then perform theprocess of FIG. 4 for each of the other users 20-2 through 20-N and 22.Alternatively, the transient friend monitoring function 30 may include aseparate thread or process for each of the users 20-1 through 20-N and22.

FIG. 5 is a graphical illustration of the operation of the transientfriend processing function 24 of FIG. 1 including the use of are-establish wait period and a proximity exit delay according to oneembodiment of the present invention. More specifically, four scenarios,scenarios A through D, are illustrated. In each scenario, a relationshipof users A and B are graphically depicted as user B comes inside aproximate area of user A, goes outside of the proximate area of user A,and then comes back inside the proximate area of user A.

In scenario A, at an initial time, Time 0, user B is initially notwithin the proximate area of user A. As such, there is no relationshipbetween users A and B. At Time 1, user B comes within the proximate areaof user A. Assuming that the conditions for adding user B as a transientfriend of user A are satisfied, user B is then added as a transientfriend of user A. Thereafter, at Time 2, user B goes outside of theproximate area of user A. In this scenario, user B does not re-enter theproximate area of user A before the proximity exit delay has expired. Asa result, user B is removed as a transient friend of user A. When user Bis removed as a transient friend of user A, a time of removal isrecorded. User B is prevented from being re-established as a transientfriend of user A until a re-establish wait period starting from the timeof removal has expired. In this example, user B re-enters the proximatearea of user A at Time 3. However, the re-establish wait period has notexpired. As such, user B is prevented from being added as a transientfriend of user A. When the re-establish wait period expires, user B isstill in the proximate area of user A. As such, user B is thenre-established as a transient friend of user A.

In scenario B, at the initial time, Time 0, user B is initially notwithin the proximate area of user A. As such, there is no relationshipbetween users A and B. At Time 1, user B comes within the proximate areaof user A. Assuming that the conditions for adding user B as a transientfriend of user A are satisfied, user B is then added as a transientfriend of user A. Thereafter, at Time 2, user B goes outside of theproximate area of user A. However, in this scenario, user B re-entersthe proximate area of user A before the proximity exit delay hasexpired. As a result, user B is not removed as a transient friend ofuser A.

In scenario C, at the initial time, Time 0, user B is initially notwithin the proximate area of user A. As such, there is no relationshipbetween users A and B. At Time 1, user B comes within the proximate areaof user A. Assuming that the conditions for adding user B as a transientfriend of user A are satisfied, user B is then added as a transientfriend of user A. Thereafter, at some time while user B is in theproximate area of user A, user A requests that user B be promoted from atransient friend to a persisted friend. As such, user B is added to thelist of persisted friends of user A and, therefore, remains a friend ofuser A regardless of location and similarity of user attributes. Note,however, that user A may thereafter choose to remove user B as apersisted friend if desired.

In scenario D, at the initial time, Time 0, user B is initially notwithin the proximate area of user A. As such, there is no relationshipbetween users A and B. At Time 1, user B comes within the proximate areaof user A. Assuming that the conditions for adding user B as a transientfriend of user A are satisfied, user B is then added as a transientfriend of user A. Thereafter, at some time while user B is in theproximate area of user A, user A requests that user B be blocked. Assuch, user B is removed as a transient friend of user A and isthereafter prevented from being added as a transient friend of user A.

FIG. 6 is a block diagram of an exemplary embodiment of the centralserver 12 of FIG. 1. In general, the central server 12 includes acontrol system 42 having associated memory 44. In this embodiment, thetransient friend processing function 24 is implemented in software andstored in the memory 44. However, the present invention is not limitedthereto. The central server 12 also includes one or more digital storagedevices 46 such as, for example, one or more hard disk drives or thelike. The user records 26 may be stored by the one or more digitalstorage devices 46. Alternatively, the user records 26 may be storedremotely and be accessible to the central server 12. The central server12 also includes a communication interface 48 communicatively couplingthe central server 12 to the network 18 (FIG. 1). Lastly, the centralserver 12 includes a user interface 50, which may include componentssuch as, for example, a display, one or more user input devices, and thelike.

FIG. 7 is a block diagram of an exemplary embodiment of the mobile userdevice 14-1 of FIG. 1. This discussion is applicable to the other mobileuser devices 14-2 through 14-N and the stationary user device 16. Ingeneral, the mobile user device 14-1 includes a control system 52 havingassociated memory 54. In this embodiment, the social networkingapplication 32-1 is implemented in software and stored in the memory 54.However, the present invention is not limited thereto. As discussedabove, the mobile user device 14-1 may also include the locationdetermination function 34-1. The mobile user device 14-1 also includesone or more digital storage devices 56 such as, for example, one or morehard disk drives or the like. The mobile user device 14-1 also includesa communication interface 58 communicatively coupling the mobile userdevice 14-1 to the network 18 (FIG. 1). Lastly, the mobile user device14-1 includes a user interface 60, which may include components such as,for example, a display, one or more user input devices, a speaker, andthe like.

Those skilled in the art will recognize improvements and modificationsto the preferred embodiments of the present invention. All suchimprovements and modifications are considered within the scope of theconcepts disclosed herein and the claims that follow.

1. A method for manipulating a friend list within a social network for afirst user comprising: selecting a second user from a list of usersproximate the first user; determining whether the second user is apersisted friend of the first user within the social network;identifying the second user that is associated with a location within aproximate area of the first user as a possible transient friend of thefirst user in the social network of the first user if the second user isnot a persisted friend of the first user with the social network; addingthe second user as a transient friend of the first user; and afteradding the second user as a transient friend of the first user,monitoring the second user such that a status of the second user as atransient friend of the first user is based upon whether the second usercontinues to be associated with a location within the proximate area ofthe first user.
 2. The method of claim 1 wherein monitoring the seconduser comprises: determining that the second user is no longer associatedwith a location within the proximate area of the first user; waiting atleast an amount of time defined by a proximity exit delay afterdetermining that the second user is no longer associated with a locationwithin the proximate area of the first user; after waiting the at leastan amount of time defined by the proximity exit delay, determiningwhether the second user is associated with a location outside theproximate area of the first user; and if a determination is made thatthe second user is associated with a location outside the proximate areaof the first user after waiting the at least an amount of time definedby the proximity exit delay, removing the second user as a transientfriend of the first user.
 3. The method of claim 1 wherein monitoringthe second user comprises removing the second user as a transient friendof the first user when the second user is no longer associated with alocation within the proximate area of the first user.
 4. The method ofclaim 3 further comprising re-establishing the second user as atransient friend of the first user when the second user is againassociated with a location within the proximate area of the first user.5. The method of claim 3 further comprising: determining when the seconduser is again associated with a location within the proximate area ofthe first user; determining whether a re-establish wait period hasexpired since the second user was removed as a transient friend of thefirst user; and if the re-establish wait period has expired, adding thesecond user as a transient friend of the first user.
 6. The method ofclaim 3 further comprising: determining when the second user is againassociated with a location within the proximate area of the first user;determining whether a re-establish wait period has expired since thesecond user was removed as a transient friend of the first user; and ifthe re-establish wait period has expired: determining whether to add thesecond user as a transient friend of the first user in the socialnetwork of the first user as a function of a comparison of at least oneattribute of the first user and at least one attribute of the seconduser; and adding the second user as a transient friend of the first userif a determination is made to add the second user as a transient friendof the first user.
 7. The method of claim 1 wherein monitoring thesecond user comprises: determining when the second user is no longerassociated with a location within the proximate area of the first user;notifying the first user such that the first user is enabled to choosewhether to remove the second user as a transient friend of the firstuser; if the first user chooses to remove the second user as a transientfriend, removing the second user as a transient friend of the firstuser; and if the first user chooses not to remove the second user,promoting the second user from a transient friend to a persisted friendof the first user.
 8. The method of claim 1 wherein identifying thesecond user that is associated with a location within the proximate areaof the first user as a transient friend of the first user comprises:determining whether to add the second user as a transient friend of thefirst user in the social network of the first user as a function of acomparison of at least one attribute of the first user and at least oneattribute of the second user; and adding the second user as a transientfriend of the first user if a determination is made to add the seconduser as a transient friend of the first user.
 9. The method of claim 8wherein determining whether to add the second user as a transient friendof the first user comprises: comparing the at least one attribute of thefirst user and the at least one attribute of the second user to providea correlation score; and determining that the second user is to be addedas a transient friend of the first user if the correlation score isgreater than a first threshold.
 10. The method of claim 9 furthercomprising, if the correlation score is less than the first threshold:determining whether the correlation score is greater than a secondthreshold; and if the correlation score is greater than the secondthreshold: notifying the first user of the second user such that thefirst user is enabled to choose whether to add the second user as atransient friend; and adding the second user as a transient friend ofthe first user if the first user chooses to add the second friend as atransient friend.
 11. The method of claim 9 wherein monitoring thesecond user comprises monitoring the second user such that the status ofthe second user as a transient friend of the first user is based uponchanges to the at least one attribute of the first user and the at leastone attribute of the second user as well as whether the second usercontinues to be associated with a location within the proximate area ofthe first user.
 12. The method of claim 11 wherein monitoring the seconduser further comprises, after adding the second user as a transientfriend of the first user: comparing the at least one attribute of thefirst user and the at least one attribute of the second user to updatethe correlation score such that the correlation score is updated inresponse to changes in the at least one attribute of the first user andthe at least one attribute of the second user; and removing the seconduser as a transient friend of the first user if the correlation scorefalls below a second threshold that is less than or equal to the firstthreshold.
 13. The method of claim 11 wherein monitoring the second userfurther comprises, after adding the second user as a transient friend ofthe first user: comparing the at least one attribute of the first userand the at least one attribute of the second user to update thecorrelation score such that the correlation score is updated in responseto any changes in the at least one attribute of the first user and theat least one attribute of the second user; notifying the first user ifthe correlation score falls below a second threshold that is less thanor equal to the first threshold such that the first user is enabled tochoose whether to remove the second user as a transient friend of thefirst user; if the first user chooses to remove the second user,removing the second user as a transient friend of the first user; and ifthe first user chooses not to remove the second user, promoting thesecond user from a transient friend to a persisted friend of the firstuser.
 14. The method of claim 1 further comprising: receiving a requestto promote the second user from a transient friend of the first user toa persisted friend of the first user in the social network of the firstuser; and in response to the request, promoting the second user from atransient friend of the first user to a persisted friend of the firstuser.
 15. The method of claim 1 further comprising: receiving a requestto block the second user from being a transient friend of the first userin the social network of the first user; and in response to the request:removing the second user as a transient friend of the first user; andsubsequently preventing the second user from being added as a transientfriend of the first user.
 16. The method of claim 1 wherein the seconduser is one of the group consisting of: a person and an automatedperson.
 17. A system comprising: a communication interfacecommunicatively coupling the system to a plurality of user devicesassociated with a plurality of users via a communication network; and acontrol system associated with the communication interface and adaptedto: obtain information identifying a location associated with each ofthe plurality of users; create a list of users proximate a first user;select a second user from the list of users proximate a first user;determine whether the second user is a persisted friend of the firstuser within a social network; identify the second user of the pluralityof users that is associated with a location within a proximate area ofthe first user as a transient friend of the first user in the socialnetwork of the first user; add the second user as a transient friend ofthe first user; and after adding the second user as a transient friendof the first user, monitor the second user such that a status of thesecond user as a transient friend of the first user is based uponwhether the second user continues to be associated with a locationwithin the proximate area of the first user.
 18. The system of claim 17wherein in order to monitor the second user, the control system isfurther adapted to: determine that the second user is no longerassociated with a location within the proximate area of the first user;wait at least an amount of time defined by a proximity exit delay afterdetermining that the second user is no longer associated with a locationwithin the proximate area of the first user; after waiting the at leastan amount of time defined by the proximity exit delay, determine whetherthe second user is associated with a location outside the proximate areaof the first user; and remove the second user as a transient friend ofthe first user if a determination is made that the second user isassociated with a location outside the proximate area of the first userafter waiting the at least an amount of time defined by the proximityexit delay.
 19. The system of claim 17 wherein in order to monitor thesecond user, the control system is further adapted to remove the seconduser as a transient friend of the first user when the second user is nolonger associated with a location within the proximate area of the firstuser.
 20. The system of claim 19 wherein the control system is furtheradapted to: determine when the second user is again associated with alocation within the proximate area of the first user; determine whethera re-establish wait period has expired since the second user was removedas a transient friend of the first user; and add the second user as atransient friend of the first user if the re-establish wait period hasexpired.
 21. The system of claim 19 wherein the control system isfurther adapted to: determine when the second user is again associatedwith a location within the proximate area of the first user; determinewhether a re-establish wait period has expired since the second user wasremoved as a transient friend of the first user; and if the re-establishwait period has expired, determine whether to add the second user as atransient friend of the first user in the social network of the firstuser as a function of a comparison of at least one attribute of thefirst user and at least one attribute of the second user; and add thesecond user as a transient friend of the first user if a determinationis made to add the second user as a transient friend of the first user.22. The system of claim 17 wherein in order to monitor the second user,the control system is further adapted to: determine when the second useris no longer associated with a location within the proximate area of thefirst user; notify the first user such that the first user is enabled tochoose whether to remove the second user as a transient friend of thefirst user; remove the second user as a transient friend of the firstuser if the first user chooses to remove the second user as a transientfriend; and promote the second user from a transient friend to apersisted friend of the first user if the first user chooses not toremove the second user.
 23. The system of claim 17 wherein in order toidentify the second user that is associated with a location within theproximate area of the first user as a transient friend of the firstuser, the control system is further adapted to: determine whether to addthe second user as a transient friend of the first user in the socialnetwork of the first user as a function of a comparison of at least oneattribute of the first user and at least one attribute of the seconduser; and add the second user as a transient friend of the first user ifa determination is made to add the second user as a transient friend ofthe first user.
 24. The system of claim 23 wherein in order to determinewhether to add the second user as a transient friend of the first user,the control system is further adapted to: compare the at least oneattribute of the first user and the at least one attribute of the seconduser to provide a correlation score; and determine that the second useris to be added as a transient friend of the first user if thecorrelation score is greater than a first threshold.
 25. The system ofclaim 24 wherein, if the correlation score is less than the firstthreshold, the control system is further adapted to: determine whetherthe correlation score is greater than a second threshold; and if thecorrelation score is greater than the second threshold: notify the firstuser of the second user such that the first user is enabled to choosewhether to add the second user as a transient friend; and add the seconduser as a transient friend of the first user if the first user choosesto add the second user as a transient friend.
 26. A method comprising:identifying as possible transient friends of a first user one or moresecond users associated with a location associated with the first userand who are members of a social network of the first user and who arenot already associated with the first user; adding at least one of theone or more second users as a transient friend of the first user; andafter adding the second user as a transient friend of the first user,monitoring the second user such that a status of the second user as atransient friend of the first user is based upon whether the second usercontinues to be associated with a location within a proximate area ofthe first user.
 27. A system comprising: a communication interfacecommunicatively coupling the system to a plurality of user devicesassociated with a plurality of users via a communication network; and acontrol system associated with the communication interface and adaptedto: identify as possible transient friends of a first user one or moresecond users associated with a location associated with the first userand who are members of a social network of the first user and who arenot already associated with the first user; add at least one of the oneor more second users as a transient friend of the first user; and afteradding the second user as a transient friend of the first user, monitorthe second user such that a status of the second user as a transientfriend of the first user is based upon whether the second user continuesto be associated with a location within a proximate area of the firstuser.
 28. A non-transitory computer readable medium comprising softwarewith instructions to: identify as possible transient friends of a firstuser one or more second users associated with a location associated withthe first user and who are members of a social network of the first userand who are not already associated with the first user; add at least oneof the one or more second users as a transient friend of the first user;and after adding the second user as a transient friend of the firstuser, monitor the second user such that a status of the second user as atransient friend of the first user is based upon whether the second usercontinues to be associated with a location within a proximate area ofthe first user.
 29. A non-transitory computer readable medium comprisingsoftware with instructions to: select a second user from a list of usersproximate a first user; determine whether the second user is a persistedfriend of the first user within a social network; identify the seconduser that is associated with a location within a proximate area of thefirst user as a possible transient friend of the first user in thesocial network of the first user if the second user is not a persistedfriend of the first user with the social network; add the second user asa transient friend of the first user; and after adding the second useras a transient friend of the first user, monitor the second user suchthat a status of the second user as a transient friend of the first useris based upon whether the second user continues to be associated with alocation within the proximate area of the first user.